Constructing all genus 2 curves with supersingular Jacobian
نویسندگان
چکیده
Abstract L. Moret-Bailly constructed families $${\mathfrak {C}}\rightarrow {\mathbb {P}}^1$$ C → P 1 of genus 2 curves with supersingular Jacobian. In this paper we first classify the reducible fibers a family using linear algebra over quaternion algebra. The main result is an algorithm that exploits properties two to compute hyperelliptic model for any irreducible fiber family.
منابع مشابه
Constructing Pairing-Friendly Genus 2 Curves with Split Jacobian
Genus 2 curves with simple but not absolutely simple jacobians can be used to construct pairing-based cryptosystems more efficient than for a generic genus 2 curve. We show that there is a full analogy between methods for constructing ordinary pairing-friendly elliptic curves and simple abelian varieties, which are iogenous over some extension to a product of elliptic curves. We extend the noti...
متن کاملCurves of Genus 2 with Split Jacobian
We say that an algebraic curve has split jacobian if its jacobian is isogenous to a product of elliptic curves. If X is a curve of genus 2, and /: X —► E a map from X to an elliptic curve, then X has split jacobian. It is not true that a complement to E in the jacobian of X is uniquely determined, but, under certain conditions, there is a canonical choice of elliptic curve E' and algebraic f:X—...
متن کاملConstructing Supersingular Elliptic Curves
We give an algorithm that constructs, on input of a prime power q and an integer t, a supersingular elliptic curve over Fq with trace of Frobenius t in case such a curve exists. If GRH holds true, the expected run time of our algorithm is e O((log q)). We illustrate the algorithm by showing how to construct supersingular curves of prime order. Such curves can readily be used for pairing based c...
متن کاملPairing Calculation on Supersingular Genus 2 Curves
In this paper we describe how to efficiently implement pairing calculation on supersingular genus 2 curves over prime fields. We find that, contrary to the results reported in [8], pairing calculation on supersingular genus 2 curves over prime fields is efficient and a viable candidate for practical implementation. We also show how to eliminate divisions in an efficient manner when computing th...
متن کاملOptimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
This article presents a novel optimal pairing over supersingular genus-2 binary hyperelliptic curves. Starting from Vercauteren’s work on optimal pairings, we describe how to exploit the action of the 2-th power Verschiebung in order to further reduce the loop length of Miller’s algorithm compared to the genus-2 ηT approach. As a proof of concept, we detail an optimized software implementation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in number theory
سال: 2022
ISSN: ['2363-9555', '2522-0160']
DOI: https://doi.org/10.1007/s40993-022-00330-z